Iterated regret minimization: A new solution concept
نویسندگان
چکیده
منابع مشابه
Iterated Regret Minimization: A New Solution Concept
For some well-known games, such as the Traveler’s Dilemma or the Centipede Game, traditional gametheoretic solution concepts—most notably Nash equilibrium—predict outcomes that are not consistent with empirical observations. We introduce a new solution concept, iterated regret minimization, which exhibits the same qualitative behavior as that observed in experiments in many games of interest, i...
متن کاملIterated Regret Minimization: A More Realistic Solution Concept
For some well-known games, such as the Traveler’s Dilemma or the Centipede Game, traditional game-theoretic solution concepts—and most notably Nash equilibrium—predict outcomes that are not consistent with empirical observations. In this paper, we introduce a new solution concept, iterated regret minimization, which exhibits the same qualitative behavior as that observed in experiments in many ...
متن کاملIterated Regret Minimization in Game Graphs
Iterated regret minimization has been introduced recently by J.Y. Halpern and R. Pass in classical strategic games. For many games of interest, this new solution concept provides solutions that are judged more reasonable than solutions offered by traditional game concepts – such as Nash equilibrium –. In this paper, we investigate iterated regret minimization for infinite duration two-player qu...
متن کاملIterated Regret Minimization in Voting Games
The game-theoretic solution concept Iterated Regret Minimization (IRM) was introduced recently by Halpern and Pass. We give the first application of IRM to simultaneous voting games. We study positional scoring rules in detail and give theoretical results demonstrating the bias of IRM toward sincere voting. We present comprehensive simulation results of the effect on social welfare of IRM compa...
متن کاملRegret Minimization With Concept Drift
In standard online learning, the goal of the learner is to maintain an average loss close to the loss of the best-performing function in a fixed class. Classic results show that simple algorithms can achieve an average loss arbitrarily close to that of the best function in retrospect, even when input and output pairs are chosen by an adversary. However, in many real-world applications such as s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Games and Economic Behavior
سال: 2012
ISSN: 0899-8256
DOI: 10.1016/j.geb.2011.05.012